Colorful combinatorics and Macdonald polynomials

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Open Problem in the Combinatorics of Macdonald Polynomials

Although a combinatorial interpretation of Macdonald polynomials involving fillings of Ferrers diagrams of partitions has been known since 2004, a general combinatorial proof of a well-known symmetry property of these polynomials remains elusive. Our paper frames the problem and discusses an already-solved special case, that of one-dimensional (single-row or single-column) Ferrers diagrams, and...

متن کامل

Macdonald Polynomials and Geometry

We explain some remarkable connections between the twoparameter symmetric polynomials discovered in 1988 by Macdonald, and the geometry of certain algebraic varieties, notably the Hilbert scheme Hilb(C 2 ) of points in the plane, and the variety Cn of pairs of commuting n× n matrices.

متن کامل

Cherednik algebras, Macdonald polynomi- als and combinatorics

In the first part of this article we review the general theory of Cherednik algebras and non-symmetric Macdonald polynomials, including a formulation and proof of the fundamental duality theorem in its proper general context. In the last section we summarize some of the combinatorial results in this area which we have recently obtained in collaboration with J. Haglund and N. Loehr. Mathematics ...

متن کامل

Factorisation of Macdonald polynomials

1. Macdonald polynomials Macdonald polynomials P λ (x; q, t) are orthogonal symmetric polynomials which are the natural multivariable generalisation of the continuous q-ultraspherical polyno-mials C n (x; β|q) [2] which, in their turn, constitute an important class of hyper-geometric orthogonal polynomials in one variable. Polynomials C n (x; β|q) can be obtained from the general Askey-Wilson p...

متن کامل

Macdonald Polynomials and Algebraic Integrability

We construct explicitly (non-polynomial) eigenfunctions of the difference operators by Macdonald in case t = q, k ∈ Z. This leads to a new, more elementary proof of several Macdonald conjectures, first proved by Cherednik. We also establish the algebraic integrability of Macdonald operators at t = q (k ∈ Z), generalizing the result of Etingof and Styrkas. Our approach works uniformly for all ro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: European Journal of Combinatorics

سال: 2019

ISSN: 0195-6698

DOI: 10.1016/j.ejc.2019.05.006